A similarity hybrid harmony search algorithm for the Team Orienteering Problem

The Harmony Search (HS) is a metaheuristic algorithm, which is inspired from the composition of music harmonies. The functionality and flexibility of HS contribute to the development of successful methodologies for different kind of scientific problems. The aim of this paper is to propose a variant of the classic HS algorithm in order to provide competitive solutions for the Team Orienteering Problem (TOP). We introduce the Similarity Hybrid Harmony Search (SHHS) algorithm as an alternative and innovative optimization method. The SHHS follows the standard procedure of HS with some modifications and includes a new strategy called “similarity process”. Two versions of the proposed method have been developed, the static version with predefined values for the parameters of the method and the dynamic one with dynamic adjustment of the parameters. The SHHS algorithm is applied to the known benchmark instances of TOP. The dynamic of the algorithm is tested through a complete solution analysis which gives the superiority of the dynamic version compared to the static one. The results of both versions of the proposed algorithm indicate the positive performance against other effective and robust optimization algorithms from the literature.     

Two-level intelligent modeling method for the rate of penetration in complex geological drilling process

The rate of penetration (ROP) model is of great importance in achieving a high efficiency in the complex geological drilling process. In this paper, a novel two-level intelligent modeling method is proposed for the ROP considering the drilling characteristics of data incompleteness, couplings, and strong nonlinearities. Firstly, a piecewise cubic Hermite interpolation method is introduced to complete the lost drilling data. Then, a formation drillability (FD) fusion submodel is established by using Nadaboost extreme learning machine (Nadaboost-ELM) algorithm, and the mutual information method is used to obtain the parameters, strongly correlated with the ROP. Finally, a ROP submodel is established by a neural network with radial basis function optimized by the improved particle swarm optimization (RBFNN-IPSO). This two-level ROP model is applied to a real drilling process and the proposed method shows the best performance in ROP prediction as compared with conventional methods. The proposed ROP model provides the basis for intelligent optimization and control in the complex geological drilling process.     

基于卷积神经网络优化TLD运动手势跟踪算法

针对TLD（Tracking-Learning-Detection）算法在光照变化不均、遮挡严重、跟踪目标模糊等情况下会出现跟踪失败的问题，提出一种基于卷积神经网络优化TLD运动手势跟踪算法。选取手势特征作正样本，其背景作负样本，获取手势HOG特征并投入到卷积神经网络中加以训练，得到手势检测分类器，从而确定目标手势区域，实现手势的自动识别；再利用TLD算法对手势进行跟踪与学习，对正负样本进行估计检测并实时校正，同时运用SURF特征匹配更新跟踪器。实验结果验证，该算法对比TLD经典算法跟踪精度提高了4.24%，增强了运动手势的跟踪效果，相比经典跟踪算法拥有更高鲁棒性。     

基于特征选择和深度信念网络的文本情感分类算法

由于人类语言的复杂性，文本情感分类算法大多都存在因为冗余而造成的词汇量过大的问题。深度信念网络（DBN）通过学习输入语料中的有用信息以及它的几个隐藏层来解决这个问题。然而对于大型应用程序来说，DBN是一个耗时且计算代价昂贵的算法。针对这个问题，提出了一种半监督的情感分类算法，即基于特征选择和深度信念网络的文本情感分类算法（FSDBN）。首先使用特征选择方法（文档频率（DF）、信息增益（IG）、卡方统计（CHI）、互信息（MI））过滤掉一些不相关的特征从而使词汇表的复杂性降低；然后将特征选择的结果输入到DBN中，使得DBN的学习阶段更加高效。将所提算法应用到中文以及维吾尔语中，实验结果表明在酒店评论数据集上，FSDBN在准确率方面比DBN提高了1.6%，在训练时间上比DBN缩短一半。     

一种作业弹性与截止时间感知的作业调度算法

针对采用MapReduce模型的大数据分析作业的调度问题进行深入研究，并分析现有任务调度算法的缺陷，现有算法没有考虑资源分配对于作业截止时间的影响，也未考虑不同类型作业截止时间的敏感性问题。因作业的完成时间随着分配资源的不同而改变，故称之为弹性作业，截止时间敏感性是指不同类型作业对截止时间要求的严格程度不同。针对以上问题，提出一种截止时间感知的弹性作业调度算法（DA）。该算法将作业依据截止时间敏感程度进行分类，在基于作业整体执行时间预测的基础上，通过调控不同的资源分配策略来改变作业完成时间，同时结合用户对于截止时间的需求及作业预执行的收益来提前规划作业的资源分配及调度次序使得整体收益最大化。将算法在仿真拥有210个物理节点的集群中进行实验，实验表明该算法满足了截止时间的限制并使得作业整体收益值平均提高了2.37倍。     

Optimal interval type-2 fuzzy fractional order super twisting algorithm: A second order sliding mode controller for fully-actuated and under-actuated nonlinear systems

In this paper, a novel interval type-2 fuzzy fractional order super twisting algorithm (IT2FFOSTA) which is essentially a second order sliding mode controller is presented. The proposed IT2FFOSTA enhances fractional order super twisting algorithm (FOSTA) by taking advantage of an interval type-2 fuzzy fractional order sliding surface (IT2FFOSS) for some classes of fully-actuated and under-actuated nonlinear systems in presence of uncertainty. The FOSTA significantly reduces the amount of chattering and the IT2FFOSS results in decreasing the tracking error, control effort, and chattering level. In order to control under-actuated systems, a hierarchical sliding surface is employed. The multi-tracker optimization algorithm is utilized to adjust the controller’s parameters; this leads to an optimal performance for the IT2FFOSTA. To examine the performance of the IT2FFOSTA, some simulation and experimental tests on three examples of different classes of fully-actuated and under-actuated systems, including ball and plate, inverted pendulum, and ball and beam systems are carried out. The simulation and experimental results demonstrate the superiority of the IT2FFOSTA in reducing the amount of chattering, tracking error, and control effort compared to those of the other control methods.     

求解约束优化问题的自适应人工蜂群算法

针对约束优化问题，提出一种自适应人工蜂群算法。算法采用反学习初始化方法使初始种群均匀分布于搜索空间。为了平衡搜索过程中可行个体和不可行个体的数量，算法使用自适应选择策略。在跟随蜂阶段，采用最优引导搜索方程来增强算法的开采能力。通过对13个标准测试问题进行实验并与其他算法比较，发现自适应人工蜂群算法具有较强的寻优能力和较好的稳定性。     

Remaining useful life prediction for degrading systems with random shocks considering measurement uncertainty

Degradation data have been widely used for the remaining useful life (RUL) prediction of systems. Most existing works apply a preset model to capture the degradation process and focus on the degradation process without shocks or constant shock effects. More generally, the actual degradation path is unobservable due to the existence of measurement uncertainty, which interferes with the determination of the degradation model. Besides, the effect of random shocks is usually fluctuating. Given these problems, a general degradation model with the random shock fluctuant effects considering the measurement uncertainty is first developed to describe the degradation process, and a two-step approach combining the arithmetic average filter and the Bayesian information criterion is adopted to identify the degradation path. Subsequently, the transfer processes of the actual degradation state and the abrupt change caused by shocks are depicted using a two-dimensional state-space model, and an expectation-maximization algorithm combined with the particle filtering is developed for parameter estimation. Furthermore, the explicit solution of RUL distribution is obtained when only considering harmful shocks, while a simulation method of RUL distribution is provided when both harmful and beneficial shocks exist. Finally, the effectiveness of the proposed method is verified by a numerical example and two practical case studies.     

Model-Based Design Space Exploration for FPGA-based Image Processing Applications Employing Parameterizable Approximations

The increasing demand for low power consumption and high computational performance is outpacing available technological improvements in embedded systems. Approximate computing is a novel design paradigm trying to bridge this gap by leveraging the inherent error resilience of certain applications and trading in quality to achieve reductions in resource usage. Numerous approximation methods have emerged in this research field. While these methods are commonly demonstrated in isolation, their combination can increase the achieved benefits in complex systems. However, the propagation of errors throughout the system necessitates a global optimization of parameters, leading to an exponentially growing design space. Additionally, the parameterization of approximated components must consider potential cross-dependencies between them. This work proposes a systematic approach to integrate and optimally configure parameterizable approximate components in FPGA-based applications, focusing on low-level but high-bandwidth image processing pipelines. The design space is explored by a multi-objective genetic algorithm which takes parameter dependencies between different components into account. During the exploration, appropriate models are used to estimate the quality-resource trade-off for probed solutions without the need for time-consuming synthesis. We demonstrate and evaluate the effectiveness of our approach on two image processing applications that employ multiple approximations. The experimental results show that the proposed methods are able to produce a wide range of Pareto-optimal solutions, offering various choices regarding the desired quality-resource trade-off.